Comprehending ADTs*
نویسنده
چکیده
We show how to generalize list comprehensions to work on abstract data types. First, we make comprehension notation automatically available for any data type that is specified as a constructor/destructor-pair (bialgebra). Second, we extend comprehensions to enable the use of different types in one comprehension and to allow to map between different types. Third, we refine the translation of comprehensions to give a reasonable behavior even for types that do not obey the monad laws, which significantly extends the scope of comprehensions.
منابع مشابه
Abstract data types as reusable software components: the case for twin ADTs
data types as reusable software components: the case for twin ADTS by K. Sikkel and J.C. van Wet Abstract data types (ADTs) are typical candidates for reusable software components. An important, although generally undecidable, question is how to design ADTs so as to make them truly reusable. In this paper, we present an elaborate example, showing that the most abstract ADT is not necessarily th...
متن کاملThe Formal Design Models of a Set of Abstract Data Types (ADTs)
Type theories are fundamental for underpinning data object modeling and system architectural design in computing and software engineering. Abstract Data Types (ADTs) are a set of highly generic and rigorously modeled data structures in type theory. ADTs also play a key role in Object-Oriented (OO) technologies for software system design and implementation. This paper presents a formal modeling ...
متن کاملThe Formal Design Models of a Set of Abstract Data Types
Type theories are fundamental for underpinning data object modeling and system architectural design in computing and software engineering. Abstract Data Types (ADTs) are a set of highly generic and rigorously modeled data structures in type theory. ADTs also play a key role in Object-Oriented (OO) technologies for software system design and implementation. This paper presents a formal modeling ...
متن کاملThe combinatorics of some abstract data types
Abstract data types (ADTs) may be regarded as abstract machines and then a program for an ADT is any sequence of operations allowed by its specification. The effect of such programs on container ADTs is captured by the relationship between each input sequence and the set of possible output sequences that can result from it. This relationship is studied principally in the case of dictionaries, s...
متن کاملDeciding and Interpolating Algebraic Data Types by Reduction (Technical Report)
Recursive algebraic data types (term algebras, ADTs) are one of the most well-studied theories in logic, and find application in contexts including functional programming, modelling languages, proof assistants, and verification. At this point, several state-of-the-art theorem provers and SMT solvers include tailor-made decision procedures for ADTs, and version 2.6 of the SMT-LIB standard includ...
متن کامل